Multimatroids I. Coverings by Independent Sets
نویسنده
چکیده
Multimatroids are combinatorial structures that generalize matroids and arise in the study of Eulerian graphs. We prove, by means of an efficient algorithm, a covering theorem for multimatroids. This theorem extends Edmonds’ covering theorem for matroids. It also generalizes a theorem of Jackson on the Euler tours of a 4-regular graph.
منابع مشابه
Multimatroids II. Orthogonality, minors and connectivity
A multimatroid is a combinatorial structure that encompasses matroids, delta-matroids and isotropic systems. This structure has been introduced to unify a theorem of Edmonds on the coverings of a matroid by independent sets and a theorem of Jackson on the existence of pairwise compatible Euler tours in a 4-regular graph. Here we investigate some basic concepts and properties related with multim...
متن کاملOn a Covering Property of Convex Sets
Let [Kx, K2, ■ ■ ■ } be a class of compact convex subsets of euclidean M-space with the property that the set of their diameters is bounded. It is shown that the sets A, can be rearranged by the application of rigid motions so as to cover the total space if and only if the sum of the volumes of all the sets A, is infinite. Also, some statements regarding the densities of such coverings are prov...
متن کاملRecombination faults in gene assembly in ciliates modeled using multimatroids
We formally model the process of gene assembly in ciliates on the level of individual genes using the notion of multimatroids introduced by Bouchet. Gene assembly involves heavy splicing and recombination, and it turns out that multimatroids form a suitable abstract model that captures essential features of this process. We use this abstract model to study the effect of faulty recombinations du...
متن کاملIsotropic Matroids I: Multimatroids and Neighborhoods
Several properties of the isotropic matroid of a looped simple graph are presented. Results include a characterization of the multimatroids that are associated with isotropic matroids and several ways in which the isotropic matroid of G incorporates information about graphs locally equivalent to G. Specific results of the latter type include a characterization of graphs that are locally equival...
متن کاملInductive tools for connected delta-matroids and multimatroids
We prove a splitter theorem for tight multimatroids, generalizing the corresponding result for matroids, obtained independently by Brylawski and Seymour. Further corollaries give splitter theorems for delta-matroids and ribbon graphs. © 2017 Elsevier Ltd. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Discrete Math.
دوره 10 شماره
صفحات -
تاریخ انتشار 1997